(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

min(x, 0) → 0
min(0, y) → 0
min(s(x), s(y)) → s(min(x, y))
max(x, 0) → x
max(0, y) → y
max(s(x), s(y)) → s(max(x, y))
minus(x, 0) → x
minus(s(x), s(y)) → s(minus(x, any(y)))
gcd(s(x), s(y)) → gcd(minus(max(x, y), min(x, y)), s(min(x, y)))
any(s(x)) → s(s(any(x)))
any(x) → x

Rewrite Strategy: INNERMOST

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

min(x, 0') → 0'
min(0', y) → 0'
min(s(x), s(y)) → s(min(x, y))
max(x, 0') → x
max(0', y) → y
max(s(x), s(y)) → s(max(x, y))
minus(x, 0') → x
minus(s(x), s(y)) → s(minus(x, any(y)))
gcd(s(x), s(y)) → gcd(minus(max(x, y), min(x, y)), s(min(x, y)))
any(s(x)) → s(s(any(x)))
any(x) → x

S is empty.
Rewrite Strategy: INNERMOST

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(4) Obligation:

Innermost TRS:
Rules:
min(x, 0') → 0'
min(0', y) → 0'
min(s(x), s(y)) → s(min(x, y))
max(x, 0') → x
max(0', y) → y
max(s(x), s(y)) → s(max(x, y))
minus(x, 0') → x
minus(s(x), s(y)) → s(minus(x, any(y)))
gcd(s(x), s(y)) → gcd(minus(max(x, y), min(x, y)), s(min(x, y)))
any(s(x)) → s(s(any(x)))
any(x) → x

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
minus :: 0':s → 0':s → 0':s
any :: 0':s → 0':s
gcd :: 0':s → 0':s → gcd
hole_0':s1_0 :: 0':s
hole_gcd2_0 :: gcd
gen_0':s3_0 :: Nat → 0':s

(5) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
min, max, minus, any, gcd

They will be analysed ascendingly in the following order:
min < gcd
max < gcd
any < minus
minus < gcd

(6) Obligation:

Innermost TRS:
Rules:
min(x, 0') → 0'
min(0', y) → 0'
min(s(x), s(y)) → s(min(x, y))
max(x, 0') → x
max(0', y) → y
max(s(x), s(y)) → s(max(x, y))
minus(x, 0') → x
minus(s(x), s(y)) → s(minus(x, any(y)))
gcd(s(x), s(y)) → gcd(minus(max(x, y), min(x, y)), s(min(x, y)))
any(s(x)) → s(s(any(x)))
any(x) → x

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
minus :: 0':s → 0':s → 0':s
any :: 0':s → 0':s
gcd :: 0':s → 0':s → gcd
hole_0':s1_0 :: 0':s
hole_gcd2_0 :: gcd
gen_0':s3_0 :: Nat → 0':s

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

The following defined symbols remain to be analysed:
min, max, minus, any, gcd

They will be analysed ascendingly in the following order:
min < gcd
max < gcd
any < minus
minus < gcd

(7) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
min(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → gen_0':s3_0(n5_0), rt ∈ Ω(1 + n50)

Induction Base:
min(gen_0':s3_0(0), gen_0':s3_0(0)) →RΩ(1)
0'

Induction Step:
min(gen_0':s3_0(+(n5_0, 1)), gen_0':s3_0(+(n5_0, 1))) →RΩ(1)
s(min(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0))) →IH
s(gen_0':s3_0(c6_0))

We have rt ∈ Ω(n1) and sz ∈ O(n). Thus, we have ircR ∈ Ω(n).

(8) Complex Obligation (BEST)

(9) Obligation:

Innermost TRS:
Rules:
min(x, 0') → 0'
min(0', y) → 0'
min(s(x), s(y)) → s(min(x, y))
max(x, 0') → x
max(0', y) → y
max(s(x), s(y)) → s(max(x, y))
minus(x, 0') → x
minus(s(x), s(y)) → s(minus(x, any(y)))
gcd(s(x), s(y)) → gcd(minus(max(x, y), min(x, y)), s(min(x, y)))
any(s(x)) → s(s(any(x)))
any(x) → x

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
minus :: 0':s → 0':s → 0':s
any :: 0':s → 0':s
gcd :: 0':s → 0':s → gcd
hole_0':s1_0 :: 0':s
hole_gcd2_0 :: gcd
gen_0':s3_0 :: Nat → 0':s

Lemmas:
min(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → gen_0':s3_0(n5_0), rt ∈ Ω(1 + n50)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

The following defined symbols remain to be analysed:
max, minus, any, gcd

They will be analysed ascendingly in the following order:
max < gcd
any < minus
minus < gcd

(10) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
max(gen_0':s3_0(n383_0), gen_0':s3_0(n383_0)) → gen_0':s3_0(n383_0), rt ∈ Ω(1 + n3830)

Induction Base:
max(gen_0':s3_0(0), gen_0':s3_0(0)) →RΩ(1)
gen_0':s3_0(0)

Induction Step:
max(gen_0':s3_0(+(n383_0, 1)), gen_0':s3_0(+(n383_0, 1))) →RΩ(1)
s(max(gen_0':s3_0(n383_0), gen_0':s3_0(n383_0))) →IH
s(gen_0':s3_0(c384_0))

We have rt ∈ Ω(n1) and sz ∈ O(n). Thus, we have ircR ∈ Ω(n).

(11) Complex Obligation (BEST)

(12) Obligation:

Innermost TRS:
Rules:
min(x, 0') → 0'
min(0', y) → 0'
min(s(x), s(y)) → s(min(x, y))
max(x, 0') → x
max(0', y) → y
max(s(x), s(y)) → s(max(x, y))
minus(x, 0') → x
minus(s(x), s(y)) → s(minus(x, any(y)))
gcd(s(x), s(y)) → gcd(minus(max(x, y), min(x, y)), s(min(x, y)))
any(s(x)) → s(s(any(x)))
any(x) → x

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
minus :: 0':s → 0':s → 0':s
any :: 0':s → 0':s
gcd :: 0':s → 0':s → gcd
hole_0':s1_0 :: 0':s
hole_gcd2_0 :: gcd
gen_0':s3_0 :: Nat → 0':s

Lemmas:
min(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → gen_0':s3_0(n5_0), rt ∈ Ω(1 + n50)
max(gen_0':s3_0(n383_0), gen_0':s3_0(n383_0)) → gen_0':s3_0(n383_0), rt ∈ Ω(1 + n3830)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

The following defined symbols remain to be analysed:
any, minus, gcd

They will be analysed ascendingly in the following order:
any < minus
minus < gcd

(13) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
any(gen_0':s3_0(+(1, n861_0))) → *4_0, rt ∈ Ω(n8610)

Induction Base:
any(gen_0':s3_0(+(1, 0)))

Induction Step:
any(gen_0':s3_0(+(1, +(n861_0, 1)))) →RΩ(1)
s(s(any(gen_0':s3_0(+(1, n861_0))))) →IH
s(s(*4_0))

We have rt ∈ Ω(n1) and sz ∈ O(n). Thus, we have ircR ∈ Ω(n).

(14) Complex Obligation (BEST)

(15) Obligation:

Innermost TRS:
Rules:
min(x, 0') → 0'
min(0', y) → 0'
min(s(x), s(y)) → s(min(x, y))
max(x, 0') → x
max(0', y) → y
max(s(x), s(y)) → s(max(x, y))
minus(x, 0') → x
minus(s(x), s(y)) → s(minus(x, any(y)))
gcd(s(x), s(y)) → gcd(minus(max(x, y), min(x, y)), s(min(x, y)))
any(s(x)) → s(s(any(x)))
any(x) → x

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
minus :: 0':s → 0':s → 0':s
any :: 0':s → 0':s
gcd :: 0':s → 0':s → gcd
hole_0':s1_0 :: 0':s
hole_gcd2_0 :: gcd
gen_0':s3_0 :: Nat → 0':s

Lemmas:
min(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → gen_0':s3_0(n5_0), rt ∈ Ω(1 + n50)
max(gen_0':s3_0(n383_0), gen_0':s3_0(n383_0)) → gen_0':s3_0(n383_0), rt ∈ Ω(1 + n3830)
any(gen_0':s3_0(+(1, n861_0))) → *4_0, rt ∈ Ω(n8610)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

The following defined symbols remain to be analysed:
minus, gcd

They will be analysed ascendingly in the following order:
minus < gcd

(16) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol minus.

(17) Obligation:

Innermost TRS:
Rules:
min(x, 0') → 0'
min(0', y) → 0'
min(s(x), s(y)) → s(min(x, y))
max(x, 0') → x
max(0', y) → y
max(s(x), s(y)) → s(max(x, y))
minus(x, 0') → x
minus(s(x), s(y)) → s(minus(x, any(y)))
gcd(s(x), s(y)) → gcd(minus(max(x, y), min(x, y)), s(min(x, y)))
any(s(x)) → s(s(any(x)))
any(x) → x

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
minus :: 0':s → 0':s → 0':s
any :: 0':s → 0':s
gcd :: 0':s → 0':s → gcd
hole_0':s1_0 :: 0':s
hole_gcd2_0 :: gcd
gen_0':s3_0 :: Nat → 0':s

Lemmas:
min(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → gen_0':s3_0(n5_0), rt ∈ Ω(1 + n50)
max(gen_0':s3_0(n383_0), gen_0':s3_0(n383_0)) → gen_0':s3_0(n383_0), rt ∈ Ω(1 + n3830)
any(gen_0':s3_0(+(1, n861_0))) → *4_0, rt ∈ Ω(n8610)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

The following defined symbols remain to be analysed:
gcd

(18) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol gcd.

(19) Obligation:

Innermost TRS:
Rules:
min(x, 0') → 0'
min(0', y) → 0'
min(s(x), s(y)) → s(min(x, y))
max(x, 0') → x
max(0', y) → y
max(s(x), s(y)) → s(max(x, y))
minus(x, 0') → x
minus(s(x), s(y)) → s(minus(x, any(y)))
gcd(s(x), s(y)) → gcd(minus(max(x, y), min(x, y)), s(min(x, y)))
any(s(x)) → s(s(any(x)))
any(x) → x

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
minus :: 0':s → 0':s → 0':s
any :: 0':s → 0':s
gcd :: 0':s → 0':s → gcd
hole_0':s1_0 :: 0':s
hole_gcd2_0 :: gcd
gen_0':s3_0 :: Nat → 0':s

Lemmas:
min(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → gen_0':s3_0(n5_0), rt ∈ Ω(1 + n50)
max(gen_0':s3_0(n383_0), gen_0':s3_0(n383_0)) → gen_0':s3_0(n383_0), rt ∈ Ω(1 + n3830)
any(gen_0':s3_0(+(1, n861_0))) → *4_0, rt ∈ Ω(n8610)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

No more defined symbols left to analyse.

(20) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n1) was proven with the following lemma:
min(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → gen_0':s3_0(n5_0), rt ∈ Ω(1 + n50)

(21) BOUNDS(n^1, INF)

(22) Obligation:

Innermost TRS:
Rules:
min(x, 0') → 0'
min(0', y) → 0'
min(s(x), s(y)) → s(min(x, y))
max(x, 0') → x
max(0', y) → y
max(s(x), s(y)) → s(max(x, y))
minus(x, 0') → x
minus(s(x), s(y)) → s(minus(x, any(y)))
gcd(s(x), s(y)) → gcd(minus(max(x, y), min(x, y)), s(min(x, y)))
any(s(x)) → s(s(any(x)))
any(x) → x

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
minus :: 0':s → 0':s → 0':s
any :: 0':s → 0':s
gcd :: 0':s → 0':s → gcd
hole_0':s1_0 :: 0':s
hole_gcd2_0 :: gcd
gen_0':s3_0 :: Nat → 0':s

Lemmas:
min(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → gen_0':s3_0(n5_0), rt ∈ Ω(1 + n50)
max(gen_0':s3_0(n383_0), gen_0':s3_0(n383_0)) → gen_0':s3_0(n383_0), rt ∈ Ω(1 + n3830)
any(gen_0':s3_0(+(1, n861_0))) → *4_0, rt ∈ Ω(n8610)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

No more defined symbols left to analyse.

(23) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n1) was proven with the following lemma:
min(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → gen_0':s3_0(n5_0), rt ∈ Ω(1 + n50)

(24) BOUNDS(n^1, INF)

(25) Obligation:

Innermost TRS:
Rules:
min(x, 0') → 0'
min(0', y) → 0'
min(s(x), s(y)) → s(min(x, y))
max(x, 0') → x
max(0', y) → y
max(s(x), s(y)) → s(max(x, y))
minus(x, 0') → x
minus(s(x), s(y)) → s(minus(x, any(y)))
gcd(s(x), s(y)) → gcd(minus(max(x, y), min(x, y)), s(min(x, y)))
any(s(x)) → s(s(any(x)))
any(x) → x

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
minus :: 0':s → 0':s → 0':s
any :: 0':s → 0':s
gcd :: 0':s → 0':s → gcd
hole_0':s1_0 :: 0':s
hole_gcd2_0 :: gcd
gen_0':s3_0 :: Nat → 0':s

Lemmas:
min(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → gen_0':s3_0(n5_0), rt ∈ Ω(1 + n50)
max(gen_0':s3_0(n383_0), gen_0':s3_0(n383_0)) → gen_0':s3_0(n383_0), rt ∈ Ω(1 + n3830)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

No more defined symbols left to analyse.

(26) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n1) was proven with the following lemma:
min(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → gen_0':s3_0(n5_0), rt ∈ Ω(1 + n50)

(27) BOUNDS(n^1, INF)

(28) Obligation:

Innermost TRS:
Rules:
min(x, 0') → 0'
min(0', y) → 0'
min(s(x), s(y)) → s(min(x, y))
max(x, 0') → x
max(0', y) → y
max(s(x), s(y)) → s(max(x, y))
minus(x, 0') → x
minus(s(x), s(y)) → s(minus(x, any(y)))
gcd(s(x), s(y)) → gcd(minus(max(x, y), min(x, y)), s(min(x, y)))
any(s(x)) → s(s(any(x)))
any(x) → x

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
minus :: 0':s → 0':s → 0':s
any :: 0':s → 0':s
gcd :: 0':s → 0':s → gcd
hole_0':s1_0 :: 0':s
hole_gcd2_0 :: gcd
gen_0':s3_0 :: Nat → 0':s

Lemmas:
min(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → gen_0':s3_0(n5_0), rt ∈ Ω(1 + n50)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

No more defined symbols left to analyse.

(29) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n1) was proven with the following lemma:
min(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → gen_0':s3_0(n5_0), rt ∈ Ω(1 + n50)

(30) BOUNDS(n^1, INF)